Finite Difference Methods for the Computation of the "Poisson Kernel" of Elliptic Operators
نویسندگان
چکیده
منابع مشابه
Fast Multipole Preconditioners for Sparse Matrices Arising from Elliptic Equations
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel rep...
متن کاملSignificant Error Propagation in the Finite Difference Solution of Non-Linear Magnetostatic Problems Utilizing Boundary Condition of the Third Kind
This paper poses two magnetostatic problems in cylindrical coordinates with different permeabilities for each region. In the first problem the boundary condition of the second kind is used while in the second one, the boundary condition of the third kind is utilized. These problems are solved using the finite element and finite difference methods. In second problem, the results of the finite di...
متن کاملMathematical Modeling of Gas Adsorption Processes in Packed Bed: The Role of Numerical Methods on Computation Time
Rigorous mathematical modeling of adsorption processes in packed beds involves time-consuming computations which are considered as the fundamental weakness of such thorough mathematical models. Thus, reducing the computation time was a key factor in improving adsorption mathematical models. In order to achieve this goal, an attempt was made to know how much using different numerical methods inf...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملG-frames and Hilbert-Schmidt operators
In this paper we introduce and study Besselian $g$-frames. We show that the kernel of associated synthesis operator for a Besselian $g$-frame is finite dimensional. We also introduce $alpha$-dual of a $g$-frame and we get some results when we use the Hilbert-Schmidt norm for the members of a $g$-frame in a finite dimensional Hilbert space.
متن کامل